Random sampling versus exact enumeration of attractors in random Boolean networks
نویسندگان
چکیده
منابع مشابه
Random sampling versus exact enumeration of attractors in random Boolean networks
We clarify the effect different sampling methods and weighting schemes have on the statistics of attractors in ensembles of random Boolean networks (RBNs). We directly measure the cycle lengths of attractors and the sizes of basins of attraction in RBNs using exact enumeration of the state space. In general, the distribution of attractor lengths differs markedly from that obtained by randomly c...
متن کاملNumber of attractors in random Boolean networks.
The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update functions. A connection is made between the terms occurring in the calculation and between the more graphic concepts of frozen, nonfrozen, and relevant node...
متن کاملRandom maps and attractors in random Boolean networks.
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per node can be seen as graphs of random maps. We introduce an approach to investigating random maps and finding analytical results for attractors in random Boo...
متن کاملTime Out of Joint: Attractors in Asynchronous Random Boolean Networks
Random Boolean networks (RBNs) are complex systems composed of many simple components which have been much analysed and shown to have many robust generic properties. Some synchronous versions have been innuential as highly abstract models of speciic biological systems, but for many biological phenomena asynchronous versions are more plausible models. Though asyn-chronous RBNs are indeterministi...
متن کاملRobustness and Information Propagation in Attractors of Random Boolean Networks
Attractors represent the long-term behaviors of Random Boolean Networks. We study how the amount of information propagated between the nodes when on an attractor, as quantified by the average pairwise mutual information (I(A)), relates to the robustness of the attractor to perturbations (R(A)). We find that the dynamical regime of the network affects the relationship between I(A) and R(A). In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2009
ISSN: 1367-2630
DOI: 10.1088/1367-2630/11/4/043024